Workload Characterization and Locality Management for Coarse-grain Multiprocessors 1 Workload Characterization and Locality Management for Coarse-grain Multiprocessors
نویسندگان
چکیده
Scalable shared memory multiprocessors commonly employ replication and the associated coherency maintenance of memory blocks, but diier in the granularity from ne-grain (cache-coherent multiproces-sors) to coarse-grain (page-based distributed shared memory systems). Regardless of the size of coherency blocks, attaining good performance may depend on the number of copies staying small. Previous work-load characterization studies of ne-grain systems have shown sharing patterns that tend toward small worker sets (set of processors sharing a block). Coarse-grain architectures ooer scalability advantages unless the sharing patterns for larger coherency blocks are considerably less favorable. This is the question we address in this paper. Our results are encouraging in that, despite the coarse granularity, worker sets scale reasonably.
منابع مشابه
Mercury: Object-Affinity Scheduling and Continuation Passing on Multiprocessors
Mercury 12, 17] is a system designed to explore methods for improving the performance of \natural grain" parallel object-oriented programs on shared memory multiprocessors with hardware-coherent caches. The novel aspects of Mercury are a locality-conscious implementation of user-level threads, new scheduling techniques based on object aanity, and a lightweight task management mechanism that use...
متن کاملScheduling to Reduce Memory Coherence Overhead on Coarse-grain Multiprocessors 1 Scheduling to Reduce Memory Coherence Overhead on Coarse-grain Multiprocessors
Some Distributed Shared Memory (DSM) and Cache-Only Memory Architecture (COMA) multiprocessors keep processes near the data they reference by transparently replicating remote data in the processes' local memories. This automatic replication of data can impose substantial memory system overhead on an application since all replicated data must be kept coherent. We examine the eeect of task schedu...
متن کاملFilaments: Efficient Support for Fine-Grain Parallelism
It has long been thought that coarse-grain parallelism is much more efficient than fine-grain parallelism due to the overhead of process (thread) creation, context switching, and synchronization. On the other hand, there are several advantages to fine-grain parallelism: architecture independence, ease of programming, ease of use as a target for code generation, and load-balancing potential. Thi...
متن کاملDEPARTMENT OF COMPUTER SCIENCE Filaments: Efficient Support for Fine-Grain Parallelism
It has long been thought that coarse-grain parallelism is much more efficient than fine-grain parallelism due to the overhead of process (thread) creation, context switching, and synchronization. On the other hand, there are several advantages to fine-grain parallelism: architecture independence, ease of programming, ease of use as a target for code generation, and load-balancing potential. Thi...
متن کاملComparative Evaluation of Fine- and Coarse-Grain Approaches for Software Distributed Shared Memory
Symmetric multiprocessors (SMPs) connected with low-latency networks provide attractive building blocks for software distributed shared memory systems. Two distinct approaches have been used: the fine-grain approach that instruments application loads and stores to support a small coherence granularity, and the coarse-grain approach based on virtual memory hardware that provides coherence at a p...
متن کامل